Query-to-Communication Lifting Using Low-Discrepancy Gadgets
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 2 January 2020Accepted: 10 November 2020Published online: 18 February 2021Keywordscommunication complexity, query liftingAMS Subject Headings68Q17Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
منابع مشابه
Query-to-Communication Lifting for P^NP
We prove that the PNP-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the PNP-type communication complexity of a lifted version of f . As an application, we show that a certain “product” lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture PNP communication complexity up to polynomial factors, which answers a...
متن کاملQuery-to-Communication Lifting for P
We prove that the P-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the P-type communication complexity of a lifted version of f . As an application, we show that a certain “product” lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture P communication complexity up to polynomial factors, which answers a quest...
متن کاملLifting randomized query complexity to randomized communication complexity
We show that for any (partial) query function f : {0, 1} → {0, 1}, the randomized communication complexity of f composed with Indexm (with m = poly(n)) is at least the randomized query complexity of f times log n. Here Indexm : [m] × {0, 1} → {0, 1} is defined as Indexm(x, y) = yx (the xth bit of y). Our proof follows on the lines of Raz and Mckenzie [RM99] (and its generalization due to [GPW15...
متن کاملSpline Methods Using Low Discrepancy Designs
Splines are minimum-norm approximations of functions that interpolate the given data, (xl, f(xl)), l = 0, . . . , N − 1. In this paper, we consider the problem of approximating functions in certain reproducing kernel Hilbert spaces, with special choices of the points xl, l = 0, . . . , N−1. The designs considered here are node sets of integration lattices and digital nets for functions f define...
متن کاملDiscrete Low-Discrepancy Sequences
Holroyd and Propp used Hall’s marriage theorem to show that, given a probability distribution π on a finite set S, there exists an infinite sequence s1, s2, . . . in S such that for all integers k ≥ 1 and all s in S, the number of i in [1, k] with si = s differs from k π(s) by at most 1. We prove a generalization of this result using a simple explicit algorithm. A special case of this algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/19m1310153